package solutions.leetcode.easy

/**
 * @author lizhidong
 * <a href="https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/">2529. 正整数和负整数的最大计数</a>
 */
private class Solution2529 {
    fun maximumCount(nums: IntArray): Int {
        var c1 = 0
        var c2 = 0
        for (item in nums) {
            if (item < 0) {
                c1++
                continue
            }
            if (item > 0) {
                c2++
            }
        }
        return Math.max(c1, c2)
    }
}

fun main() {
    println(Solution2529().maximumCount(intArrayOf()))
}